//Accepted
#include <cstdio>
#include <cmath>

int  n, i, j, k, s, p[1001];

bool isP(int x){
	s=(int)sqrt(x)+1;
	for(k=0;p[k]<s;++k)
		if(!(x%p[k]))return 0;
	return 1;
}
void init(){
	p[0]=2;
	for(i=3, j=1;i<1050;++i){
		if(isP(i))p[j++]=i;
	}
}

int main(){
	//freopen("in.txt","r",stdin);
	
	init();
	
	scanf("%d", &n);
	while(n){
		j=n;
		while(!isP(--j));
		
		for(i=2;i<=j;){
			if(i+j>n)
				while(!isP(--j));
			else if(i+j<n)
				while(!isP(++i));
			else
				break;
		}
		
		if(i+j == n) printf("%d = %d + %d\n", n, i, j);
		else printf("Goldbach's conjecture is wrong.\n");
		
		scanf("%d", &n);
	}
	return 0;
}
